Neural Networks – A Model of Boolean Functions

نویسندگان

  • Bernd Steinbach
  • Roman Kohut
چکیده

This paper deals with the representation of Boolean functions using artificial neural networks and points out three important results. First, using a polynomial as transfer function, a single neuron is able to represent a non-monotonous Boolean function. Second, the number of inputs in the neural network can be decreased if the binary values of the Boolean variables are encoded. This approach simplifies significantly the necessary number of neurons in the artificial neural network. Finally, an algorithm to compute the minimal number of neurons was developed. The lower bound, calculated by this algorithm, corresponds to a suggested structure of artificial neural networks. An example shows, how such a simple artificial neural network may represent a Boolean function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ESTIMATION OF INVERSE DYNAMIC BEHAVIOR OF MR DAMPERS USING ARTIFICIAL AND FUZZY-BASED NEURAL NETWORKS

In this paper the performance of Artificial Neural Networks (ANNs) and Adaptive Neuro- Fuzzy Inference Systems (ANFIS) in simulating the inverse dynamic behavior of Magneto- Rheological (MR) dampers is investigated. MR dampers are one of the most applicable methods in semi active control of seismic response of structures. Various mathematical models are introduced to simulate the dynamic behavi...

متن کامل

Complexity of XOR/XNOR Boolean Functions: A Model using Binary Decision Diagrams and Back Propagation Neural Networks

This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training process of experimental data already obtained for XOR/XNOR-based Boolean functions. The outcome of this model is a unique matrix for the compl...

متن کامل

Decomposition of Boolean Function Sets for Boolean Neural Networks

This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean n...

متن کامل

ارائه مدلی جهت پیش بینی بیماری دیابت با استفاده از شبکه عصبی

Introduction: Meta-heuristic and combined algorithms have a great capability in modelling medical decision making. This study used neural networks in order to predict Type 2 Diabetes (T2D) among high risk individuals. Methods: This study was   an applied research. Data from 545 individuals (diabetic and non-diabetic), in Diabetes Clinic of Hamedan University of Medical Sciences, we...

متن کامل

Analog versus discrete neural networks

We show that neural networks with three-times continuously differentiable activation functions are capable of computing a certain family of n-bit boolean functions with two gates, whereas networks composed of binary threshold functions require at least omega(log n) gates. Thus, for a large class of activation functions, analog neural networks can be more powerful than discrete neural networks, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002